迄今为止对文本生成的评估主要集中在依次创建的内容上，而不是对文本的改进。但是，写作自然是一个迭代和增量过程，需要在不同的模块化技能上进行专业知识，例如修复过时的信息或使样式更加一致。即便如此，对模型执行这些技能和编辑能力的模型能力的全面评估仍然很少。这项工作介绍了EditeVal：基于指导的，基准和评估套件，该套件利用现有的现有和新数据集自动评估编辑功能，例如使文本更具凝聚力和释义。我们评估了几种预训练的模型，这表明指令和同伴表现最好，但是大多数基准都落在监督的SOTA以下，尤其是在中和和更新信息时。我们的分析还表明，用于编辑任务的常用指标并不总是很好地关联，并且对具有最高性能的提示的优化并不一定带来对不同模型的最强鲁棒性。通过发布此基准和公开可用的排行榜挑战，我们希望在开发能够迭代和更可控制的编辑模型中解锁未来的研究。

文本内容通常是协作写作过程的输出：我们从初始草稿开始，提出建议并反复进行更改。不可知的是，当今的语言模型只能产生最终结果。结果，他们缺乏对协作写作至关重要的几种能力：他们无法更新现有文本，难以控制和无法进行口头计划或解释其行为。为了解决这些缺点，我们介绍了Peer，这是一种协作语言模型，经过训练以模仿整个写作过程本身：Peer可以编写草稿，添加建议，提出编辑并为其行为提供解释。至关重要的是，我们训练多个同伴能够填补写作过程的各个部分的实例，从而可以使用自训练技术来提高培训数据的质量，数量和多样性。这通过使其适用于没有编辑历史的域，并提高其遵循说明，编写有用的评论并解释其动作的能力，从而释放了Peer的全部潜力。我们表明，同行在各个领域和编辑任务上取得了强大的性能。

社交媒体在我们与朋友和家人的沟通以及信息和娱乐的消费中起着越来越多的作用。因此，为了在社交媒体上设计有效的排名功能，预测对帖子的情感响应将是有用的（例如，用户是否有可能幽默，启发，激怒，知情）。类似于情感识别的工作（侧重于发行者的影响），识别情感反应的传统方法将涉及培训数据的人类注释的昂贵投资。我们介绍了护理$ _ {db} $，这是一个使用常见情感响应表达式（CARE）方法根据7个情感响应注释的230k社交媒体帖子的数据集。护理方法是利用响应帖子发布的评论中存在的信号的手段，提供了有关读者对帖子而没有人类注释的情感反应的高精度证据。与人类注释不同，我们在这里描述的注释过程可以迭代以扩大方法的覆盖范围，尤其是对于新的情感反应。我们提出的实验表明，护理注释与人群的注释相比有利。最后，我们使用Care $ _ {db} $来训练基于竞争性BERT的模型来预测情感响应和情感检测，并证明了数据集用于相关任务的实用性。

In this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node in the hypergraph. HNN derives multiple embeddings per node in the hypergraph where each embedding for a node is dependent on a specific hyperedge of that node. Notably, HNN is accurate, data-efficient, flexible with many interchangeable components, and useful for a wide range of hypergraph learning tasks. We evaluate the effectiveness of the HNN framework for hyperedge prediction and hypergraph node classification. We find that HNN achieves an overall mean gain of 7.72% and 11.37% across all baseline models and graphs for hyperedge prediction and hypergraph node classification, respectively.

Learning fair graph representations for downstream applications is becoming increasingly important, but existing work has mostly focused on improving fairness at the global level by either modifying the graph structure or objective function without taking into account the local neighborhood of a node. In this work, we formally introduce the notion of neighborhood fairness and develop a computational framework for learning such locally fair embeddings. We argue that the notion of neighborhood fairness is more appropriate since GNN-based models operate at the local neighborhood level of a node. Our neighborhood fairness framework has two main components that are flexible for learning fair graph representations from arbitrary data: the first aims to construct fair neighborhoods for any arbitrary node in a graph and the second enables adaption of these fair neighborhoods to better capture certain application or data-dependent constraints, such as allowing neighborhoods to be more biased towards certain attributes or neighbors in the graph.Furthermore, while link prediction has been extensively studied, we are the first to investigate the graph representation learning task of fair link classification. We demonstrate the effectiveness of the proposed neighborhood fairness framework for a variety of graph machine learning tasks including fair link prediction, link classification, and learning fair graph embeddings. Notably, our approach achieves not only better fairness but also increases the accuracy in the majority of cases across a wide variety of graphs, problem settings, and metrics.

Facial action units (FAUs) are critical for fine-grained facial expression analysis. Although FAU detection has been actively studied using ideally high quality images, it was not thoroughly studied under heavily occluded conditions. In this paper, we propose the first occlusion-robust FAU recognition method to maintain FAU detection performance under heavy occlusions. Our novel approach takes advantage of rich information from the latent space of masked autoencoder (MAE) and transforms it into FAU features. Bypassing the occlusion reconstruction step, our model efficiently extracts FAU features of occluded faces by mining the latent space of a pretrained masked autoencoder. Both node and edge-level knowledge distillation are also employed to guide our model to find a mapping between latent space vectors and FAU features. Facial occlusion conditions, including random small patches and large blocks, are thoroughly studied. Experimental results on BP4D and DISFA datasets show that our method can achieve state-of-the-art performances under the studied facial occlusion, significantly outperforming existing baseline methods. In particular, even under heavy occlusion, the proposed method can achieve comparable performance as state-of-the-art methods under normal conditions.

We develop a wall model for large-eddy simulation (LES) that takes into account various pressure-gradient effects using multi-agent reinforcement learning (MARL). The model is trained using low-Reynolds-number flow over periodic hills with agents distributed on the wall along the computational grid points. The model utilizes a wall eddy-viscosity formulation as the boundary condition, which is shown to provide better predictions of the mean velocity field, rather than the typical wall-shear stress formulation. Each agent receives states based on local instantaneous flow quantities at an off-wall location, computes a reward based on the estimated wall-shear stress, and provides an action to update the wall eddy viscosity at each time step. The trained wall model is validated in wall-modeled LES (WMLES) of flow over periodic hills at higher Reynolds numbers, and the results show the effectiveness of the model on flow with pressure gradients. The analysis of the trained model indicates that the model is capable of distinguishing between the various pressure gradient regimes present in the flow.

准确的交通预测对于智能运输系统至关重要。尽管许多深度学习模型已经达到了最新的1小时交通预测，但长期交通预测跨越多小时仍然是一个重大挑战。此外，大多数现有的深度学习流量预测模型都是黑匣子，提出了与解释性和解释性有关的其他挑战。我们开发了图形金字塔自动构造（X-GPA），这是一种基于注意力的空间 - 速率图神经网络，使用了新型金字塔自相关注意机制。它可以从图表上的长时间序列中学习，并提高长期流量预测准确性。与几种最先进的方法相比，我们的模型可以实现高达35％的长期流量预测准确性。 X-GPA模型的基于注意力的分数提供了基于交通动态的空间和时间解释，这些解释会改变正常与高峰时段的流量以及工作日与周末流量的变化。

我们可以看到这一切吗？我们知道这一切吗？这些是我们当代社会中人类提出的问题，以评估我们解决问题的趋势。最近的研究探索了对象检测中的几种模型。但是，大多数人未能满足对客观性和预测准确性的需求，尤其是在发展中和发达国家中。因此，几种全球安全威胁需要开发有效解决这些问题的方法。本文提出了一种被称为智能监视系统（3S）的网络物理系统的对象检测模型。这项研究提出了一种2阶段的方法，突出了Yolo V3深度学习体系结构在实时和视觉对象检测中的优势。该研究实施了一种转移学习方法，以减少培训时间和计算资源。用于培训模型的数据集是MS COCO数据集，其中包含328,000个注释的图像实例。实施了深度学习技术，例如预处理，数据管道调查和检测，以提高效率。与其他新型研究模型相比，该模型的结果在检测监视镜头中的野生物体方面表现出色。记录了99.71％的精度，改进的地图为61.5。

现代自动驾驶汽车在很大程度上依赖机械激光雷达。当前的感知方法通常需要360 {\ deg}点云，随着激光雷达扫描方位角并获得连续的楔形切片，依次收集。全面扫描（〜100ms）的采集潜伏期可能导致过时的感知，这不利于安全操作。最近提出的流媒体感知作品直接处理LiDAR切片并通过以前的切片重复使用特征来补偿切片的狭窄视野（FOV）。但是，这些作品都是基于单一模式的，并且需要过去的信息可能过时。同时，高频摄像头的图像可以支持流型模型，因为它们提供了更大的FOV与LiDAR片相比。但是，FOV中的这种差异使传感器融合复杂化。为了解决这一研究差距，我们提出了一个创新的摄像头流媒体3D对象检测框架，该框架使用摄像头图像而不是过去的LiDAR切片来提供最新，密集和广泛的上下文，以进行流媒体感知。所提出的方法在挑战性的Nuscenes基准测试上优于先前的流媒体模型。它还胜过强大的全扫描探测器，同时更快。我们的方法证明对缺少相机图像，狭窄的雷达切片和小型摄像机劳动错误校准具有强大的功能。